Slugging in Houston — Casual Carpool Passenger Characteristics

The Offline Carpool Problem Revisited

The carpool problem is to schedule for every time t ∈ N l tasks taken from the set [n] (n ≥ 2). Each task i has a weight wi(t) ≥ 0, where ∑n i=1 wi(t) = l. We let ci(t) ∈ {0, 1} be 1 iff task i is scheduled at time t, where (carpool condition) wi(t) = 0 ⇒ ci(t) = 0. The carpool problem exists in the literature for l = 1, with a goal to make the schedule fair, by bounding the absolute value of E...

Characteristics of Hurricane Ike During Its Passage over Houston, Texas

CARPOOL: Connectivity Plan Routing Protocol

Basic Internet access is considered a human right, however geographical, technological and socio-economic reasons set barriers to universal Internet access. To address this challenge, we have proposed an access method based on message ferrying that enables free delay-tolerant Internet access to all, and developed Connectivity plAn Routing PrOtOcOL (CARPOOL), a reference routing protocol for the...

On fairness in the carpool problem

We discuss the carpool problem, where one has to assign drivers to subsets of participants who commute regularly. Fagin and Williams defined a notion of fair share for participants (the FW share). We provide an axiomatic characterization of the fair share and show that the FW share is the unique one satisfying these requirements. We define a coalitional game where the Shapley value is the FW sh...

Boundary control for stabilization of slugging oscillations

The problem of suppressing the slugging phenomenon is investigated. Industrial oil facilities such as gas-lifted wells and offshore production oil-risers are examples of systems where occurs such phenomenon. To study this problem, we consider that these systems are written as a set of 3 × 3 hyperbolic partial differential equations of balance laws, where the control variable appears at the boun...